Variable binding term operators in $\lambda $-calculus.
نویسندگان
چکیده
منابع مشابه
A Lambda-Calculus for Dynamic Binding
Dynamic binding is a runtime lookup operation which extracts values corresponding to some \names" from some \environments" ((nite, un-ordered associations of names and values). Many situations related with exible software assembly involve dynamic binding: rst-class modules, mobile code, object-oriented message passing. This paper proposes N, a compact extension of the-calculus to model dynamic ...
متن کاملInfinitary Lambda Calculus Innnitary Lambda Calculus
In a previous paper we have established the theory of transsnite reduction for orthogonal term rewriting systems. In this paper we perform the same task for the lambda calculus. From the viewpoint of innnitary rewriting, the BB ohm model of the lambda calculus can be seen as an innnitary term model. In contrast to term rewriting, there are several diierent possible notions of innnite term, whic...
متن کاملStorage Operators and Directed Lambda-Calculus Author(s):
Storage operators have been introduced by J. L. Krivine in [5] they are closed x-terms which, for a data type, allow one to simulate a "call by value" while using the "call by name" strategy. In this paper, we introduce the directed ;,-calculus and show that it has the usual properties of the ordinary ;,-calculus. With this calculus we get an equivalent-and simple-definition of the storage oper...
متن کاملLet-Binding with Regular Expressions in Lambda Calculus
We often give proper names to variables in programs based on their types, usages, and means, and the regularity and there are several kinds of conventions for variable-naming in programming languages. For example, we use variables i, j, k or i1, i2, i3 for thevariables of integer type. In this paper, we propose let-binding mechanism by which you can declare multiple variables simultaneously usi...
متن کاملModularity in lambda calculus
The variety (equational class) of lambda abstraction algebras was introduced to algebraize the untyped lambda calculus in the same way cylindric and polyadic algebras algebraize the rst-order predicate logic. In this paper we prove that the variety of lambda abstraction algebras is not congruence modular and that the lattice of lambda theories is not modular.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1979
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093882809